#include <iostream>
#include <queue>
using namespace std;

int main() {
    // 默认大顶堆
    priority_queue<int> maxHeap;
    maxHeap.push(3);
    maxHeap.push(1);
    maxHeap.push(5);
    cout << "Max Heap top: " << maxHeap.top() << endl; // 输出 5

    // 小顶堆
    priority_queue<int, vector<int>, greater<int>> minHeap;
    minHeap.push(3);
    minHeap.push(1);
    minHeap.push(5);
    cout << "Min Heap top: " << minHeap.top() << endl; // 输出 1

    return 0;
}
/* 运行结果:
Max Heap top: 5
Min Heap top: 1

*/